Search results for "Inductive synthesis"

Using hypothetical knowledge for driving inductive synthesis

1998

Towards efficient inductive synthesis from input/output examples

1994

ADT implementation and completion by induction from examples

1991

There exists a fast algorithm [2] for inductive synthesis of terminating and ground confluent term rewriting systems from samples. The principles of this algorithm and the methodology of its use for implementation and completion of abstract data types are described.

Inductive synthesis of term rewriting systems

2005

Fast algorithm for inductive synthesis of term rewriting systems is described and proved to be correct. It is implemented and successfully applied for inductive synthesis of different algorithms, including the binary multiplication. The algorithm proposed supports automatic learning process and can be used for designing and implementation of ADT.

Towards efficient inductive synthesis: Rapid construction of local regularities

2006

Given several input/output examples of some function we can state the problem: what is the “simplest” function which complies with these examples. This problem is well studied and is known to be very hard in the general case. In this paper we address a special case of the problem, when the target function can be expressed as a simple composition of known functions. We propose a new inductive synthesis algorithm for this case and show that it is efficient enough to synthesize complex geometry formulas.